package project.euler.honk.problem.to100;

public final class Problem77 {
	
	private static final int[] primes = new int[100000];
	private static int current = 1;
	private static int currentN = 3;

	static {
		primes[0] = 2;
	}

	private static boolean isPrime(int number) {
		if (number == 1)
			return false;
		int max = (int) Math.sqrt(number);
		for (int i = 2; i <= max; i++)
			if (number % i == 0)
				return false;
		return true;
	}	

	private static int getPrime(int index) {
		while (index >= current) {
			while (!isPrime(currentN))
				currentN++;
			primes[current] = currentN;
			currentN += 2;
			current++;
		}
		return primes[index];
	}
	
	private static int getIt(int index, int rest) {
		if(rest == 0) return 1;
		if(rest == 1) return 0;
//		if(number == 2) return 1;
//		int count = 0;
//		for(int i = 0; i * number <= rest; i++) {
//			count += getIt(number - 1, rest - i * number);
//		}
		return 0;
	}
	
	public static int solve() {
		for(int i = 0;; i++) {
			int prime;
//			if(getIt(prime, i));
		}
	}
	
	public static void main(String[] args) {
		long start = System.currentTimeMillis();
		int count = solve();
		long end = System.currentTimeMillis();
		System.out.println("Result: " + count + " Time: " + (end - start));
	}

}
